A duct mapping method using least squares support vector machines

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A duct mapping method using least squares support vector machines

[1] This paper introduces a ‘‘refractivity from clutter’’ (RFC) approach with an inversion method based on a pregenerated database. The RFC method exploits the information contained in the radar sea clutter return to estimate the refractive index profile. Whereas initial efforts are based on algorithms giving a good accuracy involving high computational needs, the present method is based on a l...

متن کامل

Fuzzy Least Squares Twin Support Vector Machines

Least Squares Twin Support Vector Machine (LSTSVM) is an extremely efficient and fast version of SVM algorithm for binary classification. LSTSVM combines the idea of Least Squares SVM and Twin SVM in which two nonparallel hyperplanes are found by solving two systems of linear equations. Although, the algorithm is very fast and efficient in many classification tasks, it is unable to cope with tw...

متن کامل

Least Squares Support Vector Machines: an Overview

Support Vector Machines is a powerful methodology for solving problems in nonlinear classification, function estimation and density estimation which has also led recently to many new developments in kernel based learning in general. In these methods one solves convex optimization problems, typically quadratic programs. We focus on Least Squares Support Vector Machines which are reformulations t...

متن کامل

Componentwise Least Squares Support Vector Machines

This chapter describes componentwise Least Squares Support Vector Machines (LS-SVMs) for the estimation of additive models consisting of a sum of nonlinear components. The primal-dual derivations characterizing LS-SVMs for the estimation of the additive model result in a single set of linear equations with size growing in the number of data-points. The derivation is elaborated for the classific...

متن کامل

Recurrent Least Squares Support Vector Machines

That is, the system has two symmetric periodic attractors, one of which is shown in Fig. 2(c). In this lemma, we can see an essential function of the ICC that makes stable dynamics by averaging two expanding maps with opposite slopes (d=d x)f (x; 1) > 1, (d=d x)f (x; 01) < 01, and 1=2j(d=d x)f (x; 1) + (d=d x)f (x; 01)j < 1 for x a < j xj < x b. Then Lemma 1 and Lemma 2 guarantee the coexisting...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Radio Science

سال: 2008

ISSN: 0048-6604

DOI: 10.1029/2008rs003842